A random mapping with preferential attachment
نویسندگان
چکیده
In this paper we investigate the asymptotic structure of a random mapping model with preferential attachment, T ρ n , which maps the set {1, 2, ..., n} into itself. The model T ρ n was introduced in a companion paper [11] and the asymptotic structure of the associated directed graph Gn which represents the action of T ρ n on the set {1, 2, ..., n} was investigated in [11] and [12] in the case when the attraction parameter ρ > 0 is fixed as n → ∞. In this paper we consider the asymptotic structure of Gn when the attraction parameter ρ ≡ ρ(n) is a function of n as n →∞. We show that there are three distinct regimes during the evolution of Gn: (i) ρn → ∞ as n → ∞, (ii) ρn → β > 0 as n →∞, and (iii) ρn → 0 as n →∞. It turns out that the asymptotic structure of Gn is, in some cases, quite different from the asymptotic structure of well-known models such as the uniform random mapping model and models with an attracting center. In particular, in regime (ii) we obtain some interesting new limiting distributions which are related to the incomplete gamma function.
منابع مشابه
Random Preferential Attachment Hypergraphs
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment evolution model than by the ordinary (uniform) evolution lodel. Analogously, this paper extends the random hypergraph model to a random preferential attachment ...
متن کاملLarge deviations, Basic information theorem for fitness preferential attachment random networks
For fitness preferential attachment random networks, we define the empirical degree and pair measure, which counts the number of vertices of a given degree and the number of edges with given fits, and the sample path empirical degree distribution. For the empirical degree and pair distribution for the fitness preferential attachment random networks, we find a large deviation upper bound. From t...
متن کاملTopological phase transition in a network model with preferential attachment and node removal
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we identify a topological phase transition depending on the rate of node removal and the relative strength of preferential vs. random attachment, where the degree d...
متن کاملRandom walk attachment graphs
We consider the random walk attachment graph introduced by Saramäki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length of the random walk is fixed then the resulting graphs can have properties significantly different from those of preferential attachment graphs, and in particular...
متن کاملPreferential attachment in randomly grown networks
We reintroduce the model of Callaway et al. (2001) as a special case of a more general model for random network growth. Vertices are added to the graph at a rate of 1, while edges are introduced at rate δ. Rather than edges being introduced at random, we allow for a degree of preferential attachment with a linear attachment kernel, parametrised by m. The original model is recovered in the limit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 34 شماره
صفحات -
تاریخ انتشار 2009